Generalizing the discrete fourier transform
نویسندگان
چکیده
منابع مشابه
The Discrete Fourier Transform∗
1 Motivation We want to numerically approximate coefficients in a Fourier series. The first step is to see how the trapezoidal rule applies when numerically computing the integral (2π) −1 2π 0 F (t)dt, where F (t) is a continuous, 2π-periodic function. Applying the trapezoidal rule with the stepsize taken to be h = 2π/n for some integer n ≥ 1 results in (2π) −1 2π 0 F (t)dt ≈ 1 n n−1 j=0 Y j , ...
متن کاملThe Discrete Fourier Transform
Disclaimer: These notes are intended to be an accessible introduction to the subject, with no pretense at completeness. In general, you can find more thorough discussions in Oppenheim's book. Please let me know if you find any typos. In this lecture, we discuss the Discrete Fourier Transform (DFT), which is a fourier representation for finite length signals. The main practical importance of thi...
متن کاملDiscrete Convolution and the Discrete Fourier Transform
Discrete Convolution First of all we need to introduce what we might call the “wraparound” convention. Because the complex numbers wj = e i 2πj N have the property wj±N = wj, which readily extends to wj+mN = wj for any integer m, and since in the discrete Fourier context we represent all N -dimensional vectors as linear combinations of the Fourier vectors Wk whose components are wkj , we make t...
متن کاملThe discrete fractional Fourier transform
We propose and consolidate a definition of the discrete fractional Fourier transform that generalizes the discrete Fourier transform (DFT) in the same sense that the continuous fractional Fourier transform generalizes the continuous ordinary Fourier transform. This definition is based on a particular set of eigenvectors of the DFT matrix, which constitutes the discrete counterpart of the set of...
متن کاملThe quick discrete Fourier transform
This paper will look at an approach that uses symmetric properties of the basis function to remove redundancies in the calculation of discrete Fourier transform (DFT). We will develop an algorithm, called the quick Fourier transform (QFT), that will reduce the number of oating point operations necessary to compute the DFT by a factor of two or four over direct methods or Goertzel's method for p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1985
ISSN: 0012-365X
DOI: 10.1016/0012-365x(85)90016-0